a-Decomposition of polygons
نویسندگان
چکیده
Decomposing a shape into visually meaningful parts comes naturally to humans, but recreating this fundamental operation in computers has been shown to be difficult. Similar challenges have puzzled researchers in shape reconstruction for decades. In this paper, we recognize the strong connection between shape reconstruction and shape decomposition at a fundamental level and propose a method called a-decomposition. The a-decomposition generates a space of decompositions parameterized by a, the diameter of a circle convolved with the input polygon. As we vary the value of a, some structural features appear and disappear quickly while others persist. Therefore, by analyzing the persistence of the features, we can determine better decompositions that are more robust to both geometrical and
منابع مشابه
Pseudo-Convex Decomposition of Simple Polygons
We extend a dynamic-programming algorithm of Keil and Snoeyink for finding a minimum convex decomposition of a simple polygon to the case when both convex polygons and pseudo-triangles are allowed. Our algorithm determines a minimum pseudo-convex decomposition of a simple polygon in O(n) time where n is the number of the vertices of the polygon. In this way we obtain a well-structured decomposi...
متن کاملPolygon Decomposition for Efficient Construction of Minkowski Sums
Several algorithms for computing the Minkowski sum of two polygons in the plane begin by decomposing each polygon into convex subpolygons. We examine diierent methods for decomposing polygons by their suitability for eecient construction of Minkowski sums. We study and experiment with various well-known decompositions as well as with several new decomposition schemes. We report on our experimen...
متن کاملPlanar Point Sets With Large Minimum Convex Decompositions
We show the existence of sets with n points (n > 4) for which every convex decomposition contains more than f§« — § polygons, which refutes the conjecture that for every set of n points there is a convex decomposition with at most n + C polygons. For sets having exactly three extreme points we show that more than n + s/2(n 3) 4 polygons may be necessary to form a convex decomposition.
متن کاملPii: S0925-7721(01)00041-4
Several algorithms for computing the Minkowski sum of two polygons in the plane begin by decomposing each polygon into convex subpolygons. We examine different methods for decomposing polygons by their suitability for efficient construction of Minkowski sums. We study and experiment with various well-known decompositions as well as with several new decomposition schemes. We report on our experi...
متن کاملAn efficient algorithm for decomposing a polygon into star-shaped polygons
In this paper we show how a theorem in plane geometry can be converted into an O(n log n) algorithm for decomposing a polygon into star-shaped subsets. The computational efficiency or this new decomposition contrasts with the heavy computational burden of existing methods. 1.0 Introduction The decomposition of a simple planar polygon into simpler components plays an important role in syntactic ...
متن کاملMinkowski decomposition of convex polygons into their symmetric and asymmetric parts
This paper discusses Minkowski decomposition of convex polygons into their symmetric and totally asymmetric parts. Two diierent types of symmetries are considered: nite order rotations and line reeections. The approach is based on the representation of convex polygons through their perimetric measure. (NWO) through a visitor's grant. He is grateful to the Centrum voor Wiskunde en Informatica (C...
متن کامل